A Comparative Review of Two-Pass Connected Component Labeling Algorithms
نویسندگان
چکیده
In this paper, we show a comparative review of Connected Component Labeling (CCL) methods, focused in two-pass variants, including their elements and implementation issues. We analyze the main elements used by these CCL algorithms and their importance for the performance of the methods using them. We present some experiments using a complex image set and evaluating the performance of each algorithm under analysis.
منابع مشابه
Comparative Study on Connected Component Labeling Algorithms for Embedded Video Processing Systems
The objective of this paper is to carry out a detailed analysis of the most popular Connected Component Labeling (CCL) algorithms for binary images. This study investigates their usability for processing streaming data and suitability for implementation using Field-Programmable Gate Array (FPGA) devices. The first part of this paper reviews popular CCL algorithms. Both capability for real-time ...
متن کاملTwo Strategies to Speed up Connected Component Labeling Algorithms
This paper presents two new strategies to speed up connected component labeling algorithms. The first strategy employs a decision tree to minimize the work performed in the scanning phase of connected component labeling algorithms. The second strategy uses a simplified union-find data structure to represent the equivalence information among the labels. For 8-connected components in a two-dimens...
متن کاملLinear-time connected-component labeling based on sequential local operations
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...
متن کاملFast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...
متن کاملEfficient Connected Component Labeling on RISC Architectures
This article introduces two fast algorithms for Connected Component Labeling of binary images, a peculiar case of coloring. The first one, SelkowDT is pixel-based and a Selkow’s algorithm combined with the Decision Tree optimization technique. The second one called Light Speed Labeling is segment-based line-relative labeling and was especially thought for commodity RISC architectures. An extens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011